Keyword Search over Graph-structured Data for Finding Effective and Non-redundant Answers

In this paper, we propose a new method for keyword search over large graph-structured data to find a set of answers which are not only relevant to the query but also reduced and duplication-free. We define an effective answer structure and a relevance measure for the candidate answers to a keyword query on graph data. We suggest an efficient indexing scheme on relevant and useful paths from nodes to keywords in the graph. We present a top-k query processing algorithm to find relevant and non-redundant answers in an efficient way by exploiting preconstructed indexes. We show by experiments using real datasets that the proposed approach can produce effective and nonredundant answers efficiently compared to the previous methods. Keywords-graph data; keyword search; top-k query processing